import java.util.Scanner;

/**
 * DP35 【模板】二维前缀和
 */
// 注意类名必须为 Main, 不要有任何 package xxx 信息
public class Main2 {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt(), m = in.nextInt(), q = in.nextInt();
        int[][] arr = new int[n + 1][m + 1];
        // 构建二维数组
        for(int i = 1; i < n + 1; i++) {
            for(int j = 1; j < m + 1; j++) {
                arr[i][j] = in.nextInt();
            }
        }

        // dp[i,j]表示从[1,1]~[i,j]内的所有元素之和
        long[][] dp = new long[n + 1][m + 1];
        for(int i = 1; i < n + 1; i++) {
            for(int j = 1; j < m + 1; j++) {
                dp[i][j] = dp[i - 1][j] + dp[i][j - 1] - dp[i - 1][j - 1] + arr[i][j];
            }
        }

        while(q > 0) {
            int x1 = in.nextInt(), y1 = in.nextInt(), x2 = in.nextInt(), y2 = in.nextInt();
            long ret = dp[x2][y2] - dp[x1 - 1][y2] - dp[x2][y1 - 1] + dp[x1 - 1][y1 - 1];
            System.out.println(ret);
            q--;
        }
    }
}